A look-ahead strategy-based method for scheduling multiprocessor tasks on two dedicated processors

نویسندگان

چکیده

In this paper, we investigate the use of a look-ahead strategy combined with path-relinking for tackling problem scheduling multiprocessor tasks on two dedicated processors. An instance is composed set divided into three subsets and processors, where some can be executed either one processor or The goal to schedule all such that execution last assigned task minimized. First, proposed method starts greedy feasible solution built by applying knapsack rule related predefined sequence. Second, series local operators are added in order drive search process around neighborhoods. Third, first diversification based upon drop rebuild employed. second diversification/intensification used highlighting performance method; it incorporates path-relinking. Finally, experimentally analyzed benchmark instances literature, its provided results compared those achieved more recent methods available literature. Its behavior also evaluated providing statistical analysis using both Sign test Wilcoxon signed-rank test.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling multiprocessor tasks on two parallel processors

In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.

متن کامل

Scheduling of Independent Dedicated Multiprocessor Tasks

We study the offline and online versions of the well known problem of scheduling a set of n independent multiprocessor tasks with prespecified processor allocations on a set of identical processors in order to minimize the makespan. Recently, in [13], it has been proven that in the case when all tasks have unit processing time the problem cannot be approximated within a factor of m 1 2 ε, neith...

متن کامل

Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times

This paper presents a scheduling technique used to optimize computation speed of loops running on architectures that may include pipelined dedicated processors. The problem under consideration is to find an optimal periodic schedule satisfying the timing constraints. Motivated by FPGA (Field-Programmable Gate Array) architecture we formulate a problem of cyclic scheduling on one dedicated proce...

متن کامل

A distributed look-ahead algorithm for scheduling interdependent tasks

Autonomous Decentralized Systems concurrently work on different types of jobs which consist of interdependent tasks ("steps"). Steps are characterized by their service requirements. It is the load balancing problem to increase the system throughput by reducing contention between steps accessing the same resources. In this paper, we propose a dynamic decentralized look-ahead scheduling algorithm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Industrial Engineering

سال: 2021

ISSN: ['0360-8352', '1879-0550']

DOI: https://doi.org/10.1016/j.cie.2021.107388